Distributed Stable Matching Problems
نویسندگان
چکیده
We consider the Stable Marriage Problem and the Stable Roommates Problem, two well-known types of the general class of Stable Matching Problems. They are combinatorial problems which can be solved by centralized algorithms in polynomial time. This requires to make public lists of preferences which agents would like to keep private. With this aim, we define the distributed version of these problems, and we provide a constraint-based approach that solves them keeping privacy. We give empirical results on the proposed approach.
منابع مشابه
Optimization in Private Stable Matching with Cost of Privacy Loss
We introduce, model and solve private non-transitivepreference-based stable matching using a new optimization framework that models privacy-loss as utility loss. Classic stable matching problems are a well known tractable application with many uses. However, some versions of stable matching problems are not tractable. One such version that we identified earlier is the stable matching with priva...
متن کاملPeer Effects and Stability in Matching Markets
Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college students, and the classic firms and workers market. In all these markets, externalities such as complementarities and peer effects severely complicate the preference ordering of each agent. Further, research has shown tha...
متن کاملDesk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework
The desk-mates matcher application places students in pairs of two for working in projects (similar to the well known problems of stable matchings or stable roommates). Each of the students has a (hopefully stable) secret preference between every two colleagues. The participants want to find an allocation satisfying their secret preferences and without leaking any of these secret preferences, e...
متن کاملStable Matching with Externalities for Beamforming and User Assignment in Multi-cell MISO Systems
We consider the problem of distributed joint user association and beamforming in multi-cell multiple-input singleoutput systems. Assuming perfect local channel state information, each base station applies a distributed beamforming scheme called WSLNR-MAX [1] which depends on the user association in the network. We determine the user association by a proposed stable matching with externalities a...
متن کاملOverlays with Preferences: Distributed, Adaptive Approximation Algorithms for Matching with Preference Lists
A key property of overlay networks is the overlay nodes’ ability to establish connections (or be matched) to other nodes by preference, based on some suitability metric related to, e.g., the node’s distance, interests, recommendations, transaction history or available resources. When there are no preference cycles among the nodes, a stable matching exists in which nodes have maximized individua...
متن کامل